Position Automaton Construction for Regular Expressions with Intersection
نویسندگان
چکیده
Positions and derivatives are two essential notions in the conversion methods from regular expressions to equivalent finite automata. Partial derivative based methods have recently been extended to regular expressions with intersection. In this paper, we present a position automaton construction for those expressions. This construction generalizes the notion of position making it compatible with intersection. The resulting automaton is homogeneous and has the partial derivative automaton as its quotient.
منابع مشابه
Algorithm to Generate DFA for AND-operator in Regular Expression
For the past time a number of algorithms were presented to produce a deterministic finite automaton (DFA) for the regular expression. These algorithms could be divided into what they used as an initial data from which to produce DFA. The method to produce DFA from non-deterministic finite automaton (NFA) by a subset construction could be generalized for extended regular expressions, including i...
متن کاملAlgorithm for the k-Position Tree Automaton Construction
The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||E || + 1) states for a word expression of alphabetic width ||E ||. This kind of automata is extended to regular tree expressions. In this paper, we give an efficient algorithm that computes the Follow sets, which are used in different algorithms of conversion of a re...
متن کاملOn the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Extended regular expressions (with complement and intersection) are used in many applications due to their succinctness. In particular, regular expressions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent nondeterministic finite automata (NFA). For practical purposes it is important to study the aver...
متن کاملMetamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata
To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...
متن کاملPosition Automata for Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system that combines Kleene and Boolean algebras. One can model basic programming constructs and assertions in KAT, which allows for its application in compiler optimization, program transformation and dataflow analysis. To provide semantics for KAT expressions, Kozen first introduced automata on guarded strings, showing that the regular sets of ...
متن کامل